Renormalizing Iterated Elementary Mappings and Correspondences of C
نویسنده
چکیده
After proving a multi-dimensional extension of Zalcman’s renormalization lemma and considering maximality problems about dimensions, we find renormalizing polynomial families for iterated elementary mappings, extending this result to some kinds of correspondences (by means of ’algebraic’ renormalizing families) and to the family of the iterated mappings of an automorphism of C2 admitting a repulsive fixed point (by means of a family of polunomial automorphisms composed with a Fatou-Bieberbach one). All families will allow maximaldimension renormalizations.
منابع مشابه
0 M ay 2 00 4 Renormalizing iterated elementary mappings and correspondences of C 2 ∗
After proving a multi-dimensional extension of Zalcman’s renormalization lemma and considering maximality problems about dimensions, we find renormalizing polynomial families for iterated elementary mappings, extending this result to some kinds of correspondences (by means of ’algebraic’ renormalizing families) and to the family of the iterated mappings of an automorphism of C2 admitting a repu...
متن کاملThe One-to-One Constraint in Analogical Mapping and Inference
Theories of analogical reasoning have assumed that a 1-to-1 constraint discourages reasoners from mapping a single element in 1 analog to multiple elements in another. Empirical evidence suggests that reasoners sometimes appear to violate the one-to-one constraint when asked to generate mappings, yet virtually never violate it when asked to generate analogical inferences. However, few studies h...
متن کاملMaximal elements of $mathscr{F}_{C,theta}$-majorized mappings and applications to generalized games
In the paper, some new existence theorems of maximal elements for $mathscr{F}_{C,theta}$-mappings and $mathscr{F}_{C,theta}$-majorized mappings are established. As applications, some new existence theorems of equilibrium points for one-person games, qualitative games and generalized games are obtained. Our results unify and generalize most known results in recent literature.
متن کاملGenerating SPARQL Executable Mappings to Integrate Ontologies
Data translation is an integration task that aims at populating a target model with data of a source model by means of mappings. Generating them automatically is appealing insofar it may reduce integration costs. Matching techniques automatically generate uninterpreted mappings, a.k.a. correspondences, that must be interpreted to perform the data translation task. Other techniques automatically...
متن کاملStrict fixed points of '{C}iri'{c}-generalized weak quasicontractive multi-valued mappings of integral type
Many authors such as Amini-Harandi, Rezapour et al., Kadelburg et al., have tried to find at least one fixed point for quasi-contractions when $alphain[frac{1}{2}, 1)$ but no clear answer exists right now and many of them either have failed or changed to a lighter version. In this paper, we introduce some new strict fixed point results in the set of multi-valued '{C}iri'{c}-gener...
متن کامل